The Model and Algorithm to Estimate the Difficulty Levels of Sudoku Puzzles

نویسنده

  • Chungen Xu
چکیده

Sudoku is a number placement mathematical puzzle based on logic. The purpose of this paper is to discuss suitable models and algorithm to generate Sudoku puzzles of varying difficulty. It is generally recognized that hand-made puzzles are more enjoyable than those generated by computer. Our goal is to establish models to generate Sudoku puzzles of varying difficulty, which are as enjoyable as hand-made ones. As we believe that puzzles generated by simulating the design process of hand-made ones will also be of much enjoyment, we established our first model -No Brute-Force. Brute-Force technique is excluded from this algorithm, for there is no enjoyment in solving puzzles using it. We have implemented the algorithm with a JAVA program. We conclude that it is possible and reasonable to generate Sudoku puzzles of varying difficulty as enjoyable as hand-made ones.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Rating and Generating Sudoku Puzzles

The Sudoku puzzle has achieved worldwide popularity recently, and attracted great attention of the computational intelligence community. How to evaluate the difficulty of the puzzle is a difficult thing. In this paper, the nondeterministic degree is regarded as the main factor that affects Sudoku puzzle and we get the difficulty through summing the entropy of each step. We give the difficulty l...

متن کامل

Rating and Generating Sudoku Puzzles Based On Constraint Satisfaction Problems

Sudoku is a logic-based combinatorial puzzle game which people in different ages enjoy playing it. The challenging and addictive nature of this game has made it a ubiquitous game. Most magazines, newspapers, puzzle books, etc. publish lots of Sudoku puzzles every day. These puzzles often come in different levels of difficulty so that all people, from beginner to expert, can play the game and en...

متن کامل

A Retrievable Genetic Algorithm for Efficient Solving of Sudoku Puzzles

Sudoku is a logic-based combinatorial puzzle game which is popular among people of different ages. Due to this popularity, computer softwares are being developed to generate and solve Sudoku puzzles with different levels of difficulty. Several methods and algorithms have been proposed and used in different softwares to efficiently solve Sudoku puzzles. Various search methods such as stochastic ...

متن کامل

Heuristic Reasoning on Graph and Game Complexity of Sudoku

The Sudoku puzzle has achieved worldwide popularity recently, and attracted great attention of the computational intelligence community. Sudoku is always considered as Satisfiability Problem or Constraint Satisfaction Problem. In this paper, we propose to focus on the essential graph structure underlying the Sudoku puzzle. First, we formalize Sudoku as a graph. Then a solving algorithm based on...

متن کامل

Solving and Rating Sudokus using Constraint Satisfiability Approaches and Genetic Algorithms

Sudoku is a very simple and well-known puzzle that has achieved international popularity in the recent past. This project addresses the problem of encoding Sudoku puzzles into conjunctive normal form (CNF), and subsequently solving them using polynomial-time propositional satisfiability (SAT) inference techniques. We introduce two straightforward SAT encodings for Sudoku: the minimal encoding a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009